TSTP Solution File: KRS276^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS276^7 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:12:39 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 29
% Syntax : Number of formulae : 48 ( 19 unt; 20 typ; 0 def)
% Number of atoms : 90 ( 16 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 218 ( 42 ~; 20 |; 5 &; 145 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 61 ( 61 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 59 ( 36 ^ 23 !; 0 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_36,type,
exists_in_world: mu > $i > $o ).
thf(decl_37,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_38,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s4: $i > $i > $o ).
thf(decl_55,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
teach: mu > mu > $i > $o ).
thf(decl_58,type,
sue: mu ).
thf(decl_59,type,
psych: mu ).
thf(decl_60,type,
mary: mu ).
thf(decl_61,type,
math: mu ).
thf(decl_62,type,
john: mu ).
thf(decl_63,type,
cs: mu ).
thf(decl_65,type,
esk2_2: $i > $i > mu ).
thf(decl_66,type,
esk3_0: $i ).
thf(decl_67,type,
esk4_0: $i ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X13: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X14: mu] : ( mnot @ ( X13 @ X14 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mexists_ind) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mnot) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mforall_ind) ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mand) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mor) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mvalid) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X4: $i > $o,X3: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ X3 @ X7 )
| ( X4 @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',mbox_s4) ).
thf(query,conjecture,
( mvalid
@ ( mbox_s4
@ ( mexists_ind
@ ^ [X21: mu] : ( teach @ X21 @ cs ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',query) ).
thf(db,axiom,
( mvalid
@ ( mbox_s4
@ ( mand @ ( teach @ john @ math )
@ ( mand
@ ( mexists_ind
@ ^ [X20: mu] : ( teach @ X20 @ cs ) )
@ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p',db) ).
thf(c_0_9,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X34: mu] :
( ( exists_in_world @ X34 @ Z1 )
=> ~ ( Z0 @ X34 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_12,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X34: mu] :
( ( exists_in_world @ X34 @ Z1 )
=> ~ ( Z0 @ X34 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_15,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_16,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ Z1 @ X7 )
| ( Z0 @ X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_17,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
thf(c_0_18,negated_conjecture,
~ ! [X46: $i,X45: $i] :
( ~ ( rel_s4 @ X46 @ X45 )
| ~ ! [X44: mu] :
( ( exists_in_world @ X44 @ X45 )
=> ~ ( teach @ X44 @ cs @ X45 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query])]),c_0_14]),c_0_15]),c_0_16])]) ).
thf(c_0_19,plain,
! [X43: $i,X42: $i] :
( ~ ( rel_s4 @ X43 @ X42 )
| ~ ( ~ ( teach @ john @ math @ X42 )
| ~ ~ ( ~ ~ ! [X41: mu] :
( ( exists_in_world @ X41 @ X42 )
=> ~ ( teach @ X41 @ cs @ X42 ) )
| ~ ~ ( ~ ( teach @ mary @ psych @ X42 )
| ~ ( teach @ sue @ psych @ X42 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[db]),c_0_17]),c_0_14]),c_0_15]),c_0_16])]) ).
thf(c_0_20,negated_conjecture,
! [X67: mu] :
( ( rel_s4 @ esk3_0 @ esk4_0 )
& ( ~ ( exists_in_world @ X67 @ esk4_0 )
| ~ ( teach @ X67 @ cs @ esk4_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
thf(c_0_21,plain,
! [X62: $i,X63: $i] :
( ( ( teach @ john @ math @ X63 )
| ~ ( rel_s4 @ X62 @ X63 ) )
& ( ( exists_in_world @ ( esk2_2 @ X62 @ X63 ) @ X63 )
| ~ ( rel_s4 @ X62 @ X63 ) )
& ( ( teach @ ( esk2_2 @ X62 @ X63 ) @ cs @ X63 )
| ~ ( rel_s4 @ X62 @ X63 ) )
& ( ( teach @ mary @ psych @ X63 )
| ~ ( rel_s4 @ X62 @ X63 ) )
& ( ( teach @ sue @ psych @ X63 )
| ~ ( rel_s4 @ X62 @ X63 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])]) ).
thf(c_0_22,negated_conjecture,
! [X10: mu] :
( ~ ( exists_in_world @ X10 @ esk4_0 )
| ~ ( teach @ X10 @ cs @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,plain,
! [X3: $i,X7: $i] :
( ( teach @ ( esk2_2 @ X3 @ X7 ) @ cs @ X7 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_24,plain,
! [X3: $i,X7: $i] :
( ( exists_in_world @ ( esk2_2 @ X3 @ X7 ) @ X7 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
rel_s4 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i] :
~ ( rel_s4 @ X3 @ esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_25,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS276^7 : TPTP v8.1.2. Released v5.5.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 14:21:46 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.TVodiQ79IR/E---3.1_27247.p
% 0.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.52 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.52 # ehoh_best2_full_lfho with pid 27391 completed with status 0
% 0.21/0.52 # Result found by ehoh_best2_full_lfho
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HHHNM-FFSF21-SHSSMFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # new_ho_10 with pid 27399 completed with status 0
% 0.21/0.52 # Result found by new_ho_10
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HHHNM-FFSF21-SHSSMFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 87
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 60
% 0.21/0.52 # Removed in clause preprocessing : 43
% 0.21/0.52 # Initial clauses in saturation : 17
% 0.21/0.52 # Processed clauses : 40
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 40
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 22
% 0.21/0.52 # ...of the previous two non-redundant : 11
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 1
% 0.21/0.52 # Paramodulations : 21
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 7
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 22
% 0.21/0.52 # Positive orientable unit clauses : 11
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 10
% 0.21/0.52 # Current number of unprocessed clauses: 5
% 0.21/0.52 # ...number of literals in the above : 6
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 18
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 6
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 6
% 0.21/0.52 # Non-unit clause-clause subsumptions : 1
% 0.21/0.52 # Unit Clause-clause subsumption calls : 5
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 4
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 40
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3392
% 0.21/0.52 # Search garbage collected termcells : 709
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.010 s
% 0.21/0.52 # Maximum resident set size: 1912 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.009 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.015 s
% 0.21/0.52 # Maximum resident set size: 1804 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------